An exact algorithm for wirelength optimal placements in VLSI design
نویسندگان
چکیده
We present a new algorithm designed to solve floorplanning problems optimally. More precisely, the algorithm finds solutions to rectangle packing problems which globally minimize wirelength and avoid given sets of blocked regions. We present the first optimal floorplans for 3 of the 5 intensely studied MCNC block packing instances and a significantly larger industrial instance with 27 rectangles and thousands of nets. Moreover, we show how to use the algorithm to place larger instances that cannot be solved optimally in reasonable runtime. keywords: Floorplanning; Placement; Rectangle Packing; Wirelength Minimization; Exact Algorithm
منابع مشابه
Zero-Skew Clock Routing Trees With Minimum Wirelength
In the design of high performance VLSI systems, minimization of clock skew is an increasingly important objective. Additionally, wirelength of clock routing trees should be minimized in order to reduce system power requirements and deformation of the clock pulse at the synchronizing elements of the system. In this paper, we present the Deferred-Merge Embedding (DME) algorithm, which in linear t...
متن کامل5 Conclusions and Directions for Future Work 4 Experimental Results
In the design of high performance VLSI systems, minimization of clock skew is an increasingly important objective. Additionally, wirelength of clock routing trees should be minimized in order to reduce system power requirements and deformation of the clock pulse at the synchronizing elements of the system. In this paper, we rst present the Deferred-Merge Embedding (DME) algorithm, which embeds ...
متن کاملExact wirelength of hypercubes on a grid
Grid embeddings are used not only to study the simulation capabilities of a parallel architecture but also to design its VLSI layout. In addition to dilation and congestion, wirelength is an important measure of an embedding. There are very few papers in the literature which provide the exact wirelength of grid embedding. As far as the most versatile architecture hypercube is concerned, only ap...
متن کاملWirelength Optimal Rectangle Packings
Finding wirelength optimal packings of rectangles is a well known problem in VLSI design. We propose a branch and bound algorithm for this problem that is based on the rectangle packing algorithm of Moffitt and Pollack. It makes use of a very efficient implementation of an incremental network simplex algorithm. Our algorithm allows for the first time to find optimum solutions of three instances...
متن کاملMinimum-Cost Bounided-Skew Clock Routing*
In this paper, we present a new clock routing algorithm which minimizes total wirelength under any given path-length skew bound. The algorithm constructs a bounded-skew tree (BST) in two steps: (i) a bottom-up phase to construct a binary tree of shortest-distancefeasible regions which represent the loci of possible placements of clock entry points, and (ii) a top-down phase to determine the exa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Integration
دوره 52 شماره
صفحات -
تاریخ انتشار 2016